Inter-program communications, program string structures

نویسنده

  • B. McLEAN
چکیده

INTRODUCTION Receptiveness to change is one of the most important attributes of a programming system. There are obvious advantages associated with being responsive to changes in a system's environment without being required to essentially redesign the system. These environmental changes may take the form of variations in the functions to be performed by the system or in the applications to which the system is put. They may be reflected in modifications of the content or structure of the data which the system is to process. They may even appear as changes in the number, type or function of the equipments comprising the computer within which the system is operated. The introduction of program modularity is one of the most common approaches to designing programming systems capable of evolutionary growth and modernization. Traditionally, modularity is associated with the division of a program system into its major components, which in turn are divided into their subcomponents, and so on. The degree to which this can be actually reduced to practice, however, is a function of the facilities available for combining the program modules into larger programs. Factors which must be considered are the extent to which inter-program dependencies exist, the nature of the mechanism available for resolving such dependencies, and the time at which they are resolved. If the program modules could be treated as completely separate entities, wholly independent of one another, they could be used as program building blocks to be arbitrarily combined to form larger programs. This generalization leads to the notion of a pool in which all program building blocks are maintained, available for use in larger programs to perform user-oriented functions. The application of Program String Structure techniques l allows such a generalization to be made, and hence allows for the realization of the notion of a program building block pool. The most essential feature of the Program String Structure concept is the introduction of Buffer Files

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tracing Program Transformations with String Origins

Program transformations play an important role in domain-specific languages and model-driven development. Tracing the execution of such transformations has well-known benefits for debugging, visualization and error reporting. In this paper, we introduce string origins, a lightweight, generic and portable technique to establish a tracing relation between the textual fragments in the input and ou...

متن کامل

Required Structures for Family Physician Program for Achieving Service Quality Dimensions in Primary Health Care: a Systematic Review

Background: The Structure of Health System affects quality of care in family physician program. This study aimed to explore the required structures of Family Physician Program for achieving service quality dimensions in Primary Health care through analyzing country experiences. These structures will be useful in achievement of quality health care in family physician system. Methods: In this sy...

متن کامل

Third-order Decentralized Safe Consensus Protocol for Inter-connected Heterogeneous Vehicular Platoons

In this paper, the stability analysis and control design of heterogeneous traffic flow is considered. It is assumed that the traffic flow consists of infinite number of cooperative non-identical vehicular platoons. Two different networks are investigated in stability analysis of heterogeneous traffic flow: 1) inter-platoon network which deals with the communication topology of lead vehicles and...

متن کامل

SEA: String Executability Analysis by Abstract Interpretation

Dynamic languages often employ reflection primitives to turn dynamically generated text into executable code at run-time. These features make standard static analysis extremely hard if not impossible because its essential data structures, i.e., the control-flow graph and the system of recursive equations associated with the program to analyse, are themselves dynamically mutating objects. We int...

متن کامل

Kolmogorov Complexity of Categories

Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of these categorical structures as the shorte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010